منابع مشابه
Quasi-Boolean Equivalence
which ought to have the value true despite the fact that the second disjunct is undefined. Such expressions, sometimes called quasi-boolean [7], are traditionally handled by the conditional connectives cand and cor [6] [9]. However, these do not satisfy pleasant algebraic laws and their use tends to complicate calculations to an unacceptable degree. In the present paper, we show that the proble...
متن کاملCCZ-equivalence and Boolean functions
We study further CCZ-equivalence of (n,m)-functions. We prove that for Boolean functions (that is, for m = 1), CCZ-equivalence coincides with EA-equivalence. On the contrary, we show that for (n,m)functions, CCZ-equivalence is strictly more general than EAequivalence when n ≥ 5 and m is greater or equal to the smallest positive divisor of n different from 1. Our result on Boolean functions allo...
متن کاملEquivalence Models for Quantified Boolean Formulas
In this paper, the notion of equivalence models for quantified Boolean formulas with free variables is introduced. The computational complexity of the equivalence model checking problem is investigated in the general case and some restricted cases. We also establish a connection between the structure of some quantified Boolean formulas and the structure of models.
متن کاملEquivalence and Isomorphism for Boolean Constraint Satisfaction
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent and prove a Dichotomy Theorem by showing that for all sets C of allowed constraints, this problem is either polynomial-tim...
متن کاملOn a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [15], coincide with initial segments of the quasi-ordered set (Ω,≤) made of the set Ω of Boolean functions, suitably quasi-ordered. The resulting ordered set (Ω/ ≡,⊑) embeds into ([ω] ,⊆), the set -ordered by inclusionof finite subsets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1993
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90211-q